A New Fast Radix-2 DIF Algorithm and Architecture for Computing the DHT
نویسندگان
چکیده
The radix-2 decimation-in-time (DIT) fast Hartley transform algorithm for computing the Discrete Hartley Transform (DHT) was introduced by Bracewell. DIT and decimation-in-frequency (DIF) algorithms were further developed by Meckelburg and Lipka, Prado, Sorenson et al, Kwong and Shiu. In these algorithms, the stage structures perform all the additions and multiplications and utilize stage dependent sine and cosine coefficients. A new fast radix-2 DIF algorithm for computing the DHT is proposed, which introduces multiplying structures in the signal flow diagram that perform all the multiplications with the stage independent cosine coefficients and their related additions leading to simplification of the stage structures which now have to perform only the additions. This leads to a reduction in the number of multiplications. An architecture utilizing current feedback operational amplifiers which implements the algorithm in hardware has been proposed. It has been tested by simulating it with the help of PSpice.
منابع مشابه
Some New Results in Fast Hartley Transform Algorithms - M.S. Thesis
Finding the spectrum of a signal swiftly has been an ever-growing demand in Digital Signal Processing. In quest to meet this stipulation, Discrete Hartley Transform (DHT) is becoming as an encouraging substitute to the more popular discrete Fourier transform. Fast methods to compute the DHT are in existence and are named as fast Hartley transforms (FHTs). In this thesis, a new split-radix FHT a...
متن کاملAn Analog Architecture for Split-Radix DHT
The fast Hartley transform and algorithm for DHT was introduced by Bracewell. The split radix decimation-infrequency algorithm that requires less number of operation counts as compared to the radix-2 and radix-4 algorithms was developed by Sorenson et al. In this paper, an analog architecture for a split radix decimation-in-time algorithm is proposed. It utilizes three different structures in t...
متن کاملHigh-Speed Pipeline Implementation of Radix-2 DIF Algorithm
In this paper, we propose a new architecture for the implementation of the N-point Fast Fourier Transform (FFT), based on the Radix-2 Decimation in Frequency algorithm. This architecture is based on a pipeline circuit that can process a stream of samples and produce two FFT transform samples every clock cycle. Compared to existing implementations the architecture proposed achieves double proces...
متن کاملHigh - Speed Pipeline Implementation of Radix - 2 DIF Algorithm
In this paper, we propose a new architecture for the implementation of the N-point Fast Fourier Transform (FFT), based on the Radix-2 Decimation in Frequency algorithm. This architecture is based on a pipeline circuit that can process a stream of samples and produce two FFT transform samples every clock cycle. Compared to existing implementations the architecture proposed achieves double proces...
متن کاملImproved and Extended Mixed-Radix Decimation in Frequency Fast MDCT Algorithm
Recently, a mixed-radix decimation in frequency (DIF) fast MDCT algorithm only for the mixed-radix decompositions or composite lengths N = 3m×2, m > 0, has been proposed in [4]. An improved mixed-radix DIF fast MDCT algorithm both in terms of the regularity and computational complexity is described. Based on observed simple algebraic identities in the original proposed algorithm [4], new formul...
متن کامل